Douglas factorization theorem revisited
نویسندگان
چکیده
منابع مشابه
Partial words and the critical factorization theorem revisited
In this paper, we consider one of the most fundamental results on periodicity of words, namely the critical factorization theorem. Given a word w and nonempty words u, v satisfying w = uv, the minimal local period associated to the factorization (u, v) is the length of the shortest square at position |u| − 1. The critical factorization theorem shows that for any word, there is always a factoriz...
متن کاملFitting of Cobb-Douglas Production Functions: Revisited
The set of Cobb-Douglas production functions is usually fitted by first linearizing the models through logarithmic transformation and then applying method of least squares. However, this procedure is valid only when the underlying assumption of multiplicative error-terms is justified. Unfortunately, this assumption is rarely satisfied in practice and accordingly, the results obtained are of dou...
متن کاملDesignated Conrmer Signatures Revisited * Douglas Wikström
Previous de nitions of designated con rmer signatures in the literature are incomplete, and the proposed security de nitions fail to capture key security properties, such as unforgeability against malicious con rmers and non-transferability. We propose new de nitions. Previous schemes rely on the random oracle model or set-up assumptions, or are secure with respect to relaxed security de nition...
متن کاملUnique factorization theorem
A property of graphs is any class of graphs closed under isomorphism. A property of graphs is induced-hereditary and additive if it is closed under taking induced subgraphs and disjoint unions of graphs, respectively. Let P1,P2, . . . ,Pn be properties of graphs. A graph G is (P1,P2, . . . ,Pn)-partitionable (G has property P1◦P2◦ · · · ◦Pn) if the vertex set V (G) of G can be partitioned into ...
متن کاملPicard ' S Theorem by Douglas Bridges
This paper deals with the numerical content of Picard's Thsorem. Two classically equivalent versions of this theorem are proved which are distinct from a computational point of view. The proofs are elementary, and constructive in the sense of Bishop. A Brouwerian counterexample is given to the original version of the theorem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2019
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc/14757